A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs
نویسندگان
چکیده
منابع مشابه
A two-stage heuristic for single machine capacitated lot-sizing and scheduling with sequence-dependent setup costs
This paper considers a single machine capacitated lot-sizing and scheduling problem. The problem is to determine the lot sizes and the sequence of lots while satisfying the demand requirements and the machine capacity in each period of a planning horizon. In particular, we consider sequence-dependent setup costs that depend on the type of the lot just completed and on the lot to be processed. T...
متن کاملLot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities
This paper deals with lot sizing and scheduling for a single-stage, single-machine production system where setup costs and times are sequence dependent. A large-bucket mixed integer programming (MIP) model is formulated which considers only e$cient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and e$ciently. The size of solvable case...
متن کاملCapacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
In production planning, sequence dependent setup times and costs are often incurred for switchovers from one product to another. When setup times and costs do not respect the triangular inequality, a situation may occur where the optimal solution includes more than one batch of the same product in a single period — in other words, at least one sub tour exists in the production sequence of that ...
متن کاملLot sizing and scheduling with sequence-dependent setup costs and times and e$cient rescheduling opportunities
This paper deals with lot sizing and scheduling for a single-stage, single-machine production system where setup costs and times are sequence dependent. A large-bucket mixed integer programming (MIP) model is formulated which considers only e$cient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and e$ciently. The size of solvable case...
متن کاملLot Sizing and Scheduling with Sequence Dependent Setup Costs and times and Eecient Rescheduling Opportunities
1 Summary: This paper deals with lot sizing and scheduling for a single-stage production system where setup costs and times are sequence dependent. A large bucket mixed integer programming (MIP) model is formulated which considers only eecient sequences. A tailor-made enumeration method of the branch-and-bound type solves problem instances optimally and eeciently. Furthermore, it will become cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial Engineering and Management
سال: 2013
ISSN: 2013-0953,2013-8423
DOI: 10.3926/jiem.707